Foundations of Interval Computation
نویسنده
چکیده
This paper reports a study of numerical computation problems from a theoretical viewpoint. It shows that computer systems are not capable of computing of real numbers correctly due to the differences between the algebraic structures of real numbers and model numbers. These two classes of numbers are not isomorphic. From this study, we have learned that there are no machine errors or computation errors. If fact, one can view it is a human mistake by putting real valued problem onto a model number platform for computation. This paper proposes use of the concept of computer model numbers to approximate rough numbers for computation. Moreover, we revise an arbitrary initial compact interval to a shortest initial closed-open model interval for ordinary interval computation. This way, we can assure that the final resulting interval will be the shortest interval and that the computation will result in the greatest precision.
منابع مشابه
Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملWAI'96: II Workshop on Computer Arithmetic, Interval and Symbolic Computation
On August 7-8, 1996, the second Workshop on Computer Arithmetic, Interval and Symbolic Computation was held in Recife, Brazil. The main purpose of the workshop was to bring together researchers interested in scientific computation and related topics and to present and discuss recent advances in this branch of computer science and its applications. Total about 27 talks and 10 posters were presen...
متن کاملPartial Semigroups and Convolution Algebras
Partial Semigroups are relevant to the foundations of quantum mechanics and combinatorics as well as to interval and separation logics. Convolution algebras can be understood either as algebras of generalised binary modalities over ternary Kripke frames, in particular over partial semigroups, or as algebras of quantale-valued functions which are equipped with a convolution-style operation of mu...
متن کاملStability and vibration analyses of tapered columns resting on one or two-parameter elastic foundations
This paper presents a generalized numerical method to evaluate element stiffness matrices needed for the free vibration and stability analyses of non-prismatic columns resting on one- or two-parameter elastic foundations and subjected to variable axial load. For this purpose, power series approximation is used to solve the fourth–order differential equation of non-prismatic columns with v...
متن کاملPhilosophical and Axiomatic Grounding of Fuzzy Theory
At times, it is essential to re-affirm the philosophical and axiomatic foundations of Fuzzy Theory in order to search and discover new avenues of research and to shed a new light onto basic assumptions. For such a purpose, first, the perspectives of Pierce and Zadeh are review with regards to determinacy and indeterminacy. Secondly, the ontological and epistemological foundations of both the Cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007